Techniques for separating space complexity classes
نویسندگان
چکیده
منابع مشابه
Separating Complexity Classes Using Autoreducibility
A set is autoreducible if it can be reduced to itself by a Turing machine that does not ask its own input to the oracle. We use autoreducibility to separate the polynomial-time hierarchy from polynomial space by showing that all Turing-complete sets for certain levels of the exponential-time hierarchy are autoreducible but there exists some Turing-complete set for doubly exponential space that ...
متن کاملSeparating the complexity classes NL and NP
There is no first order reduction from 3COLOR to REACH. Therefore NL 6= NP.
متن کاملSeparating NOF communication complexity classes RP and NP
In the number-on-forehead (NOF) model of communication complexity, k players are trying to evaluate a function F defined on kn bits. The input of F is partitioned into k pieces of n bits each, call them x1, . . . ,xk, and xi is placed, metaphorically, on the forehead of player i. Thus, each player sees (k − 1)n of the kn input bits. The players communicate by writing bits on a shared blackboard...
متن کاملSeparating NE from Some Nonuniform Nondeterministic Complexity Classes
We investigate the question whether NE can be separated from the reduction closures of tally sets, sparse sets and NP. We show that (1) NE ⊆ RNP no(1)−T (TALLY); (2) NE ⊆ R m (SPARSE); (3) NEXP ⊆ PNP nk−T /n for all k ≥ 1; and (4) NE ⊆ Pbtt (NP ⊕ SPARSE). Result (3) extends a previous result by Mocas to nonuniform reductions. We also investigate how different an NE-hard set is from an NP-set. W...
متن کاملPolynomial-Time Random Oracles and Separating Complexity Classes
Bennett and Gill (1981) showed that P 6= NP 6= coNP for a random oracle A, with probability 1. We investigate whether this result extends to individual polynomial-time random oracles. We consider two notions of random oracles: p-random oracles in the sense of martingales and resource-bounded measure (Lutz, 1992; Ambos-Spies et al., 1997), and p-betting-game random oracles using the betting game...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer and System Sciences
سال: 1977
ISSN: 0022-0000
DOI: 10.1016/s0022-0000(77)80041-x